Frequency Assignment Method using NFD and Graph Coloring for Backbone Wireless Links of Tactical Communications Network
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولCognitive radio networks for tactical wireless communications
....... The modern battlefield is a demanding environment for tactical radio networks in that in addition to the variation in the wireless propagation environment, the radio must co-exist and contend with a high density of emitters having varying waveforms. Cognitive Radio (CR) is widely considered as a promising technology for providing the mechanisms to mitigate interference, and allow more f...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملLinearization of M-LINC Systems Using GMP and Particle Swarm Optimization for Wireless Communications
In this paper, an efficient algorithm for the efficiency maximization of the multilevel linear amplification using nonlinear components (M-LINC) systems is proposed regarding the linearity of the system. In this algorithm, we use the generalized memory polynomial (GMP) to provide a behavioral model for the power amplifier (PA) and calculate the power spectral density (PSD) of the output signal ...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Institute of Military Science and Technology
سال: 2015
ISSN: 1598-9127
DOI: 10.9766/kimst.2015.18.4.441